Dynamic Byzantine Broadcast in Asynchronous Message-Passing Systems

The reconfiguration problem is considered a key challenge in distributed systems, especially dynamic asynchronous message-passing systems. To keep the data reliability and availability long-lived any protocols should support reconfigurations, to dynamically add resources, or remove old slow machines with newer faster ones. Previous results reconfigurations either rely on consensus, study restricted crash failures only. However, it difficult argue that real-world systems experience In this paper, we dynamic reconfiguration fully Byzantine faults. We first specify broadcast, then clean explicit liveness condition. show broadcast solvable by presenting consistent algorithm reliable algorithm.